On the Chromaticity of Multi-Bridge Hypergraphs

نویسندگان

  • Syed Ahtsham Ul Haq Bokhary
  • Ioan Tomescu
  • Akhlaq Ahmad Bhatti
چکیده

A multi-bridge hypergraph is an h-uniform linear hypergraph consisting of some linear paths having common extremities. In this paper it is proved that the multisets of path lengths of two chromatically equivalent multi-bridge hypergraphs are equal provided the multiplicities of path lengths are bounded above by 2h−1 − 2. ∗This research is partially supported by Abdus Salam School of Mathematical Sciences, Lahore and Higher Education Commission of Pakistan. Also, it is shown that h-uniform linear cycles of length m are not chromatically unique for every m,h ≥ 3.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Chromatic polynomials of some mixed hypergraphs

Motivated by a recent result of Walter [Electron. J. Combin. 16 (2009), R94] concerning the chromatic polynomials of some hypergraphs, we present the chromatic polynomials of several (non-uniform) mixed hypergraphs. We use a recursive process for generating explicit formulae for linear mixed hypercacti and multi-bridge mixed hypergraphs using a decomposition of the underlying hypergraph into bl...

متن کامل

Damage detection of multi-girder bridge superstructure based on the modal strain approaches

The research described in this paper focuses on the application of modal strain techniques on a multi-girder bridge superstructure with the objectives of identifying the presence of damage and detecting false damage diagnosis for such structures. The case study is a one-third scale model of a slab-on-girder composite bridge superstructure, comprised of a steel-free concrete deck with FRP rebars...

متن کامل

On chromaticity of hypergraphs

Let H = (X,E) be a simple hypergraph and let f (H, ) denote its chromatic polynomial. Two hypergraphs H1 and H2 are chromatic equivalent if f (H1, ) = f (H2, ). The equivalence class of H is denoted by 〈H 〉. Let K and H be two classes of hypergraphs.H is said to be chromatically characterized in K if for every H ∈ H ∩K we have 〈H 〉 ∩K=H ∩K. In this paper we prove that uniform hypertrees and uni...

متن کامل

Strategic Planning for the National Bridge Stock of Iran

The National Bridge Stock of Iran consists of about 330,000 bridges, of which around 50% are older than 30 years. Since 2010, Iran Road Maintenance & Transportation Organization has started implementing a comprehensive Bridge Management System in order to manage this aged stock efficiently. To predict future conditions of bridge stock, a heuristic numerical method is presented. This methodology...

متن کامل

Selective Harmonics Elimination Technique in Cascaded H-Bridge Multi-Level Inverters Using the Salp Swarm Optimization Algorithm

A new optimization method is proposed in this paper for finding the firing angles in multi-level voltage source inverters to eliminate low-order selective harmonics and reduce total harmonic distortion (THD) value of the output voltage. For thid end, Fourier series is used for calculating objective function and selecting specific harmonics. Regarding the nature and complexity of the employed no...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Graphs and Combinatorics

دوره 25  شماره 

صفحات  -

تاریخ انتشار 2009